Hybrid evolutionary computation methods for quay crane scheduling problems

نویسندگان

  • Su Nguyen
  • Mengjie Zhang
  • Mark Johnston
  • Kay Chen Tan
چکیده

This section provides detailed results for all sets of benchmark instances introduced by Meisel [1]. The notations of problems characteristics are the same as ones used in Meisel [1]. Loc indicates the distributions of tasks on the vessel, f indicates the the handling rate, d is the precedence density, q is the number of QCs, and s is the safety distance. The signs ∗ and ▲ respectively indicate that the proposed methods are able to find the optimal solutions or improve the best known solutions (BKS) as compared to CPLEX and UDS. Here, best, avg., and tbest denote the best and average makespans and the average time in seconds (from the five independent runs) to find the best solution in a run with HGA and HGP.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Mathematical Model and Grouping Imperialist Competitive Algorithm for Integrated Quay Crane and Yard Truck Scheduling Problem with Non-crossing Constraint

In this research, an integrated approach is presented to simultaneously solve quay crane scheduling and yard truck scheduling problems. A mathematical model was proposed considering the main real-world assumptions such as quay crane non-crossing, precedence constraints and variable berthing times for vessels with the aim of minimizing vessels completion time. Based on the numerical results, thi...

متن کامل

Addressing a Coordinated Quay Crane Scheduling and Assignment Problem by Red Deer Algorithm

Nowadays, there is much attention for planning of container terminals in the global trade centers. The high cost of quay cranes motivates both scholars and industrial practitioners especially in the last decade to develop novel optimization models to address this dilemma. This study proposes a coordinated optimization model to cover both Quay Crane Scheduling Problem (QCSP) and Quay Crane Assig...

متن کامل

Quay Cranes and Yard Trucks Scheduling Problem at Container Terminals

A bi-objective mathematical model is developed to simultaneously consider the quay crane and yard truck scheduling problems at container terminals. Main real-world assumptions, such as quay cranes with non-crossing constraints, quay cranes’ safety margins and precedence constraints are considered in this model. This integrated approach leads to better efficiency and productivity at container te...

متن کامل

Simultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals

In this work, we focus on the integrated planning of the following problems faced within the context of seaside operations at container terminals: berth allocation, quay crane assignment, and quay crane scheduling. First, we formulate a new binary integer linear program for the integrated solution of the berth allocation and quay crane assignment problems called BACAP. Then we extend it by inco...

متن کامل

An evolutionary approach to solving a new integrated quay crane assignment and quay crane scheduling mathematical model

This paper puts forward an integrated optimisation model that combines two distinct problems arising in container terminals, namely the Quay Crane Assignment Problem, and the Quay Crane Scheduling Problem. The model is of the mixed-integer programming type with the objective being to minimise the tardiness of vessels. Although exact solutions can be found to the problem using Branch-and-Cut, fo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computers & OR

دوره 40  شماره 

صفحات  -

تاریخ انتشار 2013